Presentation On Choice Number Of Integer Distance Graph
نویسندگان
چکیده
منابع مشابه
effect of oral presentation on development of l2 learners grammar
this experimental study has been conducted to test the effect of oral presentation on the development of l2 learners grammar. but this oral presentation is not merely a deductive instruction of grammatical points, in this presentation two hypotheses of krashen (input and low filter hypotheses), stevicks viewpoints on grammar explanation and correction and widdowsons opinion on limited use of l1...
15 صفحه اولLower Bounds on the Distance Domination Number of a Graph
For an integer k ≥ 1, a (distance) k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G) \ S is at distance at most k from some vertex of S. The k-domination number, γk(G), of G is the minimum cardinality of a k-dominating set of G. In this talk, we establish lower bounds on the k-domination number of a graph in terms of its diameter, radius and gir...
متن کاملBounds on the Distance Two-Domination Number of a Graph
For a graph G = (V , E), a subset D V ðGÞ is said to be distance two-dominating set in G if for each vertex u 2 V D, there exists a vertex v 2 D such that dðu; vÞ 2. The minimum cardinality of a distance two-dominating set in G is called a distance twodomination number and is denoted by c2ðGÞ. In this note we obtain various upper bounds for c2ðGÞ and characterize the classes of graphs attaining...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملVertex arboricity of integer distance graph G(Dm, k)
Let D be a subset of the positive integers. The distance graph G(Z,D) has all integers as its vertices and two vertices x and y are adjacent if and only if |x − y| ∈ D, where the set D is called distance set. The vertex arboricity va(G) of a graph G is the minimum number of subsets into which vertex set V(G) can be partitioned so that each subset induces an acyclic subgraph. In this paper, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
سال: 2019
ISSN: 0973-8975,2454-7190
DOI: 10.26782/jmcms.spl.2019.08.00075